Covering points with minimum/maximum area orthogonally convex polygons
نویسندگان
چکیده
منابع مشابه
Covering the Plane with Convex Polygons
It is proved that for any centrally symmetric convex polygonal domain P and for any natural number r, there exists a constant k = k(P, r) such that any k-fold covering of the plane with translates of P can be split into r simple coverings.
متن کاملEqual Area Polygons in Convex Bodies
In this paper, we consider the problem of packing two or more equal area polygons with disjoint interiors into a convex body K in E such that each of them has at most a given number of sides. We show that for a convex quadrilateral K of area 1, there exist n internally disjoint triangles of equal area such that the sum of their areas is at least 4n 4n+1 . We also prove results for other types o...
متن کاملConvex lattice polygons of fixed area with perimeter-dependent weights.
We study fully convex polygons with a given area, and variable perimeter length on square and hexagonal lattices. We attach a weight tm to a convex polygon of perimeter m and show that the sum of weights of all polygons with a fixed area s varies as s(-theta(conv))eK(t)square root(s) for large s and t less than a critical threshold tc, where K(t) is a t-dependent constant, and theta(conv) is a ...
متن کاملDrawing Area-Proportional Venn-3 Diagrams with Convex Polygons
Area-proportional Venn diagrams are a popular way of visualizing the relationships between data sets, where the set intersections have a specified numerical value. In these diagrams, the areas of the regions are in proportion to the given values. Venn-3, the Venn diagram consisting of three intersecting curves, has been used in many applications, including marketing, ecology and medicine. Whils...
متن کاملCovering many points with a small-area box
Let P be a set of n points in the plane. We show how to find, for a given integer k > 0, the smallest-area axis-parallel rectangle that covers k points of P in O(nk log n+ n log n) time. We also consider the problem of, given a value α > 0, covering as many points of P as possible with an axis-parallel rectangle of area at most α. For this problem we give a randomized (1−ε)-approximation that w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2016
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2016.02.003